An Algorithmic Approach for Solving ETSP Using Premium Solver Platform
نویسنده
چکیده
Spreadsheet software, notably Microsoft Excel©, can be used very effectively for analyzing logistics and supply chain issues. Spreadsheet allow analysis from many different perspectives and can be modified and enhanced to reflect new situations and options. Our purpose in this article is to demonstrate the efficiency of a problemsolving algorithm that uses Microsoft Excel add-in tools Premium Solver Platform for solving small-size Euclidean Traveling Salesman Problems (ETSP).
منابع مشابه
A dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملConstraint Answer Set Solving
We present a new approach to integrating Constraint Processing (CP) techniques into Answer Set Programming (ASP). Based on an alternative semantic approach, we develop an algorithmic framework for conflict-driven ASP solving that exploits CP solving capacities. A significant technical issue concerns the combination of conflict information from different solver types. We have implemented our app...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملConflict-driven answer set solving: From theory to practice
We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capturing diverse inferences encountered in ASP solving. Moreover, our approach allows us to apply ad...
متن کاملInterval Constraint Solving Using Propositional SAT Solving Techniques
In order to facilitate automated reasoning about large Boolean combinations of non-linear arithmetic constraints involving transcendental functions, we extend the paradigm of lazy theorem proving to intervalbased arithmetic constraint solving. Algorithmically, our approach deviates substantially from “classical” lazy theorem proving approaches in that it directly controls arithmetic constraint ...
متن کامل